例句與造句

1. The affine scaling algorithm for convex programming with linear constraints
   線性約束凸規(guī)劃問(wèn)題的仿尺度算法
2. The improved method is more efficient to derive linear constraints
   改進(jìn)后的方法建立線性約束系統(tǒng)的效率更高。
3. Research on the genetic algorithms for linear constraint optimization problems
   線性約束優(yōu)化問(wèn)題的遺傳優(yōu)化方法研究
4. In operations research , a procedure for locating the maximum or minimum of a linear function of variables that are subject to linear constraints
   在運(yùn)籌學(xué)中,找出受線性約束的變量的線性函數(shù)的最大值或最小值的過(guò)程。
5. There are many existing algorithms that solve the maximin or minimax programming without constraint or with linear constraints . some of the algorithms need the 2nd order differential information of objective functions
   人們已提出了一些求解maximin (或minimax )規(guī)劃的算法，這些算法要求規(guī)劃問(wèn)題無(wú)約束或具有線性約束，以及要求有關(guān)函數(shù)的二次微分信息
6. It's difficult to find linear constraint in a sentence. 用linear constraint造句挺難的
7. The module conversion for a kind of max - min problems is given , namely , the max - min problem with equality and inequality constraint is converted into convex problem with linear constraint , which provides theoretical basis for designing effective algorithms
   最后，給出一類極大極小問(wèn)題的模型轉(zhuǎn)化，把帶等式、不等式約束的極大極小問(wèn)題轉(zhuǎn)化為帶線性約束的凸規(guī)劃問(wèn)題，這為設(shè)計(jì)更為有效的算法提供了理論依據(jù)。
8. Normally , we try to get the dual form of mathematical programming to change primary programming , which is difficult to be solved into its dual programming , which is easily to be solved . after we had got the dual form of two programming , we found their form were very simply because they had only nonnegative and linear constraints
   通常，我們求出規(guī)劃問(wèn)題的對(duì)偶形式是希望將不易求解的原問(wèn)題轉(zhuǎn)化為易于求解的對(duì)偶問(wèn)題，在分別得到這兩類問(wèn)題的對(duì)偶形式后，發(fā)現(xiàn)其形式簡(jiǎn)單，只帶有非負(fù)約束和線性約束。